Different Versions of ILU and IUL Factorizations Obtained from Forward and Backward Factored Approximate Inverse Processes - Part I
نویسندگان
چکیده
We present an incomplete UL IUL decomposition of matrixAwhich is extracted as a by-product of BFAPINV backward factored approximate inverse process. We term this IUL factorization as IULBF. We have used ILUFF 3 and IULBF as left preconditioner for linear systems. Different versions of ILUFF and IULBF preconditioners are computed by using different dropping techniques. In this paper, we compare quality of different versions of ILUFF and IULBF preconditioners.
منابع مشابه
ILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کاملComplete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
متن کاملExtending the pivoting strategy of Backward IJK version of Gaussian Elimination to an IUL preconditioner
Consider the linear system of equations of the form Ax = b where the coefficient matrix A ∈ Rn×n is nonsingular, large, sparse and nonsymmetric and also x, b ∈ R. We refer to this system as the original system. An explicit preconditioner M for this system is an approximation of matrix A−1. In [1], Lou presented the Backward Factored INVerse or BFINV algorithm which computes the inverse factoriz...
متن کاملOn the Relations between ILUs and Factored Approximate Inverses
This paper discusses some relationships between Incomplete LU (ILU) factoriza-tion techniques and factored sparse approximate inverse (AINV) techniques. While ILU factorizations compute approximate LU factors of the coeecient matrix A, AINV techniques aim at building triangular matrices Z and W such that W > AZ is approximately diagonal. The paper shows that certain forms of approximate inverse...
متن کاملMultigrid Treatment and Robustness Enhancement for Factored Sparse Approximate Inverse Preconditioning
We investigate the use of sparse approximate inverse techniques (SAI) in a grid based multilevel ILU preconditioner (GILUM) to design a robust parallelizable precon-ditioner for solving general sparse matrix. Taking the advantages of grid based mul-tilevel methods, the resulting preconditioner outperforms sparse approximate inverse in robustness and eeciency. Conversely, taking the advantages o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. Numerical Analysis
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011